Smoothing Spline ANOVA Decomposition of Arbitrary Splines: An Application to Eye Movements in Reading

نویسندگان

  • Hannes Matuschek
  • Reinhold Kliegl
  • Matthias Holschneider
چکیده

The Smoothing Spline ANOVA (SS-ANOVA) requires a specialized construction of basis and penalty terms in order to incorporate prior knowledge about the data to be fitted. Typically, one resorts to the most general approach using tensor product splines. This implies severe constraints on the correlation structure, i.e. the assumption of isotropy of smoothness can not be incorporated in general. This may increase the variance of the spline fit, especially if only a relatively small set of observations are given. In this article, we propose an alternative method that allows to incorporate prior knowledge without the need to construct specialized bases and penalties, allowing the researcher to choose the spline basis and penalty according to the prior knowledge of the observations rather than choosing them according to the analysis to be done. The two approaches are compared with an artificial example and with analyses of fixation durations during reading.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

INTERPOLATION BY HYPERBOLIC B-SPLINE FUNCTIONS

In this paper we present a new kind of B-splines, called hyperbolic B-splines generated over the space spanned by hyperbolic functions and we use it to interpolate an arbitrary function on a set of points. Numerical tests for illustrating hyperbolic B-spline are presented.

متن کامل

Computationally Efficient Models of Urban and Natural Terrain by Non-iterative Domain Decomposition for L1 Smoothing Splines

In this paper, we propose and validate a computationally efficient non-iterative domain decomposition procedure for calculating bivariate cubic L1 smoothing splines. This domain decomposition procedure involves calculating local L1 smoothing splines individually on overlapping “extended subdomains” that cover the global domain and then creating the global L1 smoothing spline by patching togethe...

متن کامل

Smoothing Spline Density Estimation : Conditional Distribution

This article extends recent developments in penalized likelihood probability density estimation to the estimation of conditional densities on generic domains. Positivity and unity constraints for a probability density are enforced through a one-to-one logistic conditional density transform made possible by term trimming in an ANOVA decomposition of multivariate functions. The construction of mo...

متن کامل

Study of Evolutionary and Swarm Intelligent Techniques for Soccer Robot Path Planning

Finding an optimal path for a robot in a soccer field involves different parameters such as the positions of the robot, positions of the obstacles, etc. Due to simplicity and smoothness of Ferguson Spline, it has been employed for path planning between arbitrary points on the field in many research teams. In order to optimize the parameters of Ferguson Spline some evolutionary or intelligent al...

متن کامل

Equivalent kernels of smoothing splines in nonparametric regression for clustered/longitudinal data

S For independent data, it is well known that kernel methods and spline methods are essentially asymptotically equivalent (Silverman, 1984). However, recent work of Welsh et al. (2002) shows that the same is not true for clustered/longitudinal data. Splines and conventional kernels are different in localness and ability to account for the within-cluster correlation. We show that a smoothi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2015